混合不确定条件下的飞行器级间分离可靠性分析

为量化飞行器级间分离过程随机不确定性和认知不确定性的综合影响,结合概率和区间理论混合模型特点,提出了一种基于随机和区间理论混合模型的飞行器级间分离可靠性分析方法。面向高超声速飞行器分离任务需求,建立分离动力学仿真模型,针对级间分离结构的几何特点,设计了一种快速碰撞检测方法,进而构建了分离任务的可靠性分析混合模型。通 过将该模型转化为随机可靠性分析的无约束优化问题,考虑分离过程中复杂外力及力矩导致功能函数高度非线性的特点,利用高效全局优化和主动学习Kriging方法实现无约束优化问题高效求解。结合实例表明,该方法能够准确描述混合不确定性因素对飞行器分离过程的影响,给出了飞行器分离任务可靠性区间,可为飞行器分离方案的精细化设计提供决策支持。     

远程反舰导弹弹道规划研究

以保证远程反舰导弹迅速捕捉目标为出发点,以远程反舰导弹的作战需求为牵引,论述了对远程反舰导弹进行弹道规划的重要意义;从战术和技术两个方面探索了对远程反舰导弹进行弹道规划的主要依据、基本原则、规划思路和基本方法。     

带混合误差的Ishikawa迭代格式

将Ishikawa型迭代格式的收敛性问题推广到带混合误差的Ishikawa型迭代格式的情形 ,同时所用的证明方法和技巧有所改进     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

反恐兵力分配运筹方法辅助决策研究

将影响兵力分配决策的各主要因素及其相互关系抽象为线性规划数学模型，通过数学模型的求解，可确定最佳兵力分配方案。模型的建立过程可灵活地体现所有主要的现实需要和考虑因素，因而具有广泛的适用性。计算机软件的引入，可瞬问求得最优解，满足实际作战需要。     

Column generation for stochastic green telecommunication network planning with switchable base stations

We present the green telecommunication network planning problem with switchable base stations, where the location and configuration of the base stations are optimized, while taking into account uncertainty and variability of demand. The problem is formulated as a two‐stage stochastic program under demand uncertainty with integers in both stages. Since solving the presented problem is computationally challenging, we develop the corresponding Dantzig‐Wolfe reformulation and propose a solution approach based on column generation. Comprehensive computational results are provided for instances of varying characteristics. The results show that the joint location and dynamic switching of base stations leads to significant savings in terms of energy cost. Up to 30% reduction in power consumption cost is achieved while still serving all users. In certain cases, allowing dynamic configurations leads to more installed base stations and higher user coverage, while having lower total energy consumption. The Dantzig‐Wolfe reformulation provides solutions with a tight LP‐gap eliminating the need for a full branch‐and‐price scheme. Furthermore, the proposed column generation solution approach is computationally efficient and outperforms CPLEX on the majority of the tested instances. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 351–366, 2016     

Investment in production resource flexibility: An empirical investigation of methods for planning under uncertainty

We examine several methods for evaluating resource acquisition decisions under uncertainty. Traditional methods may underestimate equipment benefit when part of this benefit comes from decision flexibility. We develop a new, practical method for resource planning under uncertainty, and show that this approach is more accurate than several commonly used methods. We successfully applied our approach to an investment problem faced by a major firm in the aviation information industry. Our recommendations were accepted and resulted in estimated annual savings in excess of $1 million (US). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

飞行器航路规划算法分析

针对现代军用飞行器任务规划系统航路规划的特点,分析了飞行器航路规划的基本要求,阐述了目前国内外应用和研究的几种航路规划算法:A*搜索算法、遗传算法、粒子群算法、数学规划算法、电势理论法等,并对飞行器航路规划算法的发展趋势进行了展望.     

一种用浮点除实现整除的方法

本文提出一种用浮点除法来实现整数除法的方法。对这种方法可能带来的误差进行估计井给出了商的修正方法。最后研究一个实例并对该方法进行了评价。